Maximal switchability of centralized networks
نویسندگان
چکیده
منابع مشابه
Maximal switchability of centralized networks
We consider continuous time Hopfield-like recurrent networks as dynamical models for gene regulation and neural networks. We are interested in networks that contain n high-degree nodes preferably connected to a large number of Ns weakly connected satellites, a property that we call n/Ns-centrality. If the hub dynamics is slow, we obtain that the large time network dynamics is completely defined...
متن کاملA centralized privacy-preserving framework for online social networks
There are some critical privacy concerns in the current online social networks (OSNs). Users' information is disclosed to different entities that they were not supposed to access. Furthermore, the notion of friendship is inadequate in OSNs since the degree of social relationships between users dynamically changes over the time. Additionally, users may define similar privacy settings for their f...
متن کاملCentralized versus Decentralized Infrastructure Networks
While many large infrastructure networks, such as power, water, and natural gas systems, have similar physical properties governing flows, these systems tend to have distinctly different sizes and topological structures. This paper seeks to understand how these different size-scales and topological features can emerge from relatively simple design principles. Specifically, we seek to describe t...
متن کاملCentralized netting in financial networks
We consider how the introduction of centralized netting in financial networks affects total netted exposures between counterparties. In some cases there is a trade-off: centralized netting increases the expectation of net exposures, but reduces the variance. We show that the set of networks for which expected net exposures decreases is a strict subset of those for which the variance decreases, ...
متن کاملSwitchability and collapsibility of Gap Algebras
Let A be an idempotent algebra on a 3-element domain D that omits a G-set for a factor. Suppose A is not αβ-projective (for some α, β ⊂ D so that α ∪ β = D and α ∩ β 6= ∅) and is not collapsible. It follows that A is switchable. We prove that, for every finite subset ∆ of Inv(A), Pol(∆) is collapsible. We also exhibit an algebra that is collapsible from a non-singleton source but is not collaps...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nonlinearity
سال: 2016
ISSN: 0951-7715,1361-6544
DOI: 10.1088/0951-7715/29/8/2327